Sparse Estimation of Polynomial and Rational Dynamical Models
نویسندگان
چکیده
منابع مشابه
Robust Estimation in Linear Regression with Molticollinearity and Sparse Models
One of the factors affecting the statistical analysis of the data is the presence of outliers. The methods which are not affected by the outliers are called robust methods. Robust regression methods are robust estimation methods of regression model parameters in the presence of outliers. Besides outliers, the linear dependency of regressor variables, which is called multicollinearity...
متن کاملSparse Identification of Polynomial and Posynomial Models
Posynomial models are widely used in various engineering design endeavors, such as circuits, aerospace and structural design, mainly due to the fact that design problems cast in terms of posynomial objectives and constraints can be solved efficiently by means of a convex optimization technique known as geometric programming (GP). However, while quite a vast literature exists on GP-based design,...
متن کاملHyperbolic estimation of sparse and blocky models
For image estimation we use a hyperbolic penalty function. The center of a hyperbola is parabolic like `2 norm fitting. Its asymptotes are like `1 norm fitting. A transition threshold must be chosen for regression equations of data fitting and another for model regularization. We adapt the conjugate direction method to solve this problem in a manner we call the HYCD method. We present examples ...
متن کاملEfficient estimation of polynomial chaos proxies using generalized sparse quadrature
We investigate the use of sparse grid methods in computing polynomial chaos (PC) proxies for forward stochastic problems associated with numerically-expensive simulators. These are problems where some input parameters are random with known distributions, and stochastic properties of the simulator output are desired. The bottleneck for PC proxy construction is the estimation of the coefficients,...
متن کاملRational and Polynomial Matrices
where λ = s or λ = z for a continuousor discrete-time realization, respectively. It is widely accepted that most numerical operations on rational or polynomial matrices are best done by manipulating the matrices of the corresponding descriptor system representations. Many operations on standard matrices (such as finding the rank, determinant, inverse or generalized inverses, nullspace) or the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2014
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2014.2351711